Decomposition Strategies for Constructive Preference Elicitation

نویسندگان

  • Paolo Dragone
  • Stefano Teso
  • Mohit Kumar
  • Andrea Passerini
چکیده

We tackle the problem of constructive preference elicitation, that is the problem of learning user preferences over very large decision problems, involving a combinatorial space of possible outcomes. In this setting, the suggested configuration is synthesized on-the-fly by solving a constrained optimization problem, while the preferences are learned iteratively by interacting with the user. Previous work has shown that Coactive Learning is a suitable method for learning user preferences in constructive scenarios. In Coactive Learning the user provides feedback to the algorithm in the form of an improvement to a suggested configuration. When the problem involves many decision variables and constraints, this type of interaction poses a significant cognitive burden on the user. We propose a decomposition technique for large preferencebased decision problems relying exclusively on inference and feedback over partial configurations. This has the clear advantage of drastically reducing the user cognitive load. Additionally, part-wise inference can be (up to exponentially) less computationally demanding than inference over full configurations. We discuss the theoretical implications of working with parts and present promising empirical results on one synthetic and two realistic constructive problems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructive Preference Elicitation over Hybrid Combinatorial Spaces

Peference elicitation is the task of suggesting a highly preferred configuration to a decision maker. The preferences are typically learned by querying the user for choice feedback over pairs or sets of objects. In its constructive variant, new objects are synthesized “from scratch” by maximizing an estimate of the user utility over a combinatorial (possibly infinite) space of candidates. In th...

متن کامل

Constructive Preference Elicitation

When faced with large or complex decision problems, human decision makers (DM) can make costly mistakes, due to inherent limitations of their memory, attention, and knowledge. Preference elicitation tools assist the decision maker in overcoming these limitations. They do so by interactively learning the DM’s preferences through appropriately chosen queries and suggesting high-quality outcomes b...

متن کامل

Constructed Preferences and Value-focused Thinking: Implications for AI research on Preference Elicitation

Decision theory has changed considerably in the last decade. In behavioral decision theory, a large number of studies have shown that human decision making is inherently adaptive and constructive. In prescriptive decision theory, we have witnessed a move from an alternative-focused approach to a value-focused approach. In this paper, we discuss the implications of these new ideas in behavioral ...

متن کامل

Constructive Preference Elicitation by Setwise Max-Margin Learning

In this paper we propose an approach to preference elicitation that is suitable to large configuration spaces beyond the reach of existing state-of-theart approaches. Our setwise max-margin method can be viewed as a generalization of max-margin learning to sets, and can produce a set of “diverse” items that can be used to ask informative queries to the user. Moreover, the approach can encourage...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1711.08247  شماره 

صفحات  -

تاریخ انتشار 2017